Numerical Method


Q1.

The bisection method is applied to compute a zero of the function f(x) = x^{4}-x^{3}-x^{2}-4 in the interval [1,9]. The method converges to a solution after _____iterations.
GateOverflow

Q2.

Given X: 0 10 16 Y: 6 16 28 The interpolated value X=4 using piecewise linear interpolation is
GateOverflow

Q3.

What is the sum to infinity of the series,3+6 x^{2}+9 x^{4}+12 x^{6}+\ldots \text { given }|x| \lt 1
GateOverflow

Q4.

Using Newton-Raphson method, a root correct to 3 decimal places of x^{3}-3 x-5=0
GateOverflow

Q5.

Newton-Raphson method is used to compute a root of the equation x^{2} -13=0 with 3.5 as the initial value. The approximation after one iteration is
GateOverflow

Q6.

In the Newton-Raphson method, an initial guess of x_{0}=2 is made and the sequence x_{0},x_{1},x_{2}... is obtained for the function 0.75x^{3}-2x^{2}-2x+4=0 Consider the statements (I) x_{3}=0. (II) The method converges to a solution in a finite number of iterations. Which of the following is TRUE?
GateOverflow

Q7.

Consider the polynomial p(x) = a_0 + a_1x + a_2x^2 + a_3x^3 , where a_i \neq 0, \forall i. The minimum number of multiplications needed to evaluate p on an input x is:
GateOverflow

Q8.

The Guass-Seidal iterative method can be used to solve which of the following sets?
GateOverflow

Q9.

The Newton-Raphson iteration x_{n+1}=\frac{1}{2}(x_{n}+\frac{R}{x_{n}}) can be used to compute the
GateOverflow

Q10.

A root \alpha of equation f(x)=0 can be computed to any degree of accuracy if a 'good' initial approximation x_0 is chosen for which
GateOverflow